Graph-Guided Deformation for Point Cloud Completion

نویسندگان

چکیده

For a long time, the point cloud completion task has been regarded as pure generation task. After obtaining global shape code through encoder, complete is generated using priorly learnt by networks. However, such models are undesirably biased towards prior average objects and inherently limited to fit geometry details. In this letter, we propose Graph-Guided Deformation Network, which respectively regards input data intermediate controlling supporting points, optimization guided graph convolutional network(GCN) for Our key insight simulate least square Laplacian deformation process via mesh methods, brings adaptivity modeling variation in By means, also reduce gap between algorithms. As far know, first refine mimicing traditional graphics algorithms with GCN-guided deformation. We have conducted extensive experiments on both simulated indoor dataset ShapeNet, outdoor KITTI, our self-collected autonomous driving Pandar40. The results show that method outperforms existing state-of-the-art 3D

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Template Deformation for Point Cloud Fitting

The reconstruction of high-quality surface meshes from measured data is a vital stage in digital shape processing. We present a new approach to this problem that deforms a template surface to fit a given point cloud. Our method takes a template mesh and a point cloud as input, the latter typically shows missing parts and measurement noise. The deformation process is initially guided by user spe...

متن کامل

Graph Matrix Completion in Presence of Outliers

Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...

متن کامل

Graph Cut Based Point-Cloud Segmentation for Polygonal Reconstruction

The reconstruction of 3D objects from a point-cloud is based on sufficient separation of the points representing objects of interest from the points of other, unwanted objects. This operation called segmentation is discussed in this paper. We present an interactive unstructured pointcloud segmentation based on graph cut method where the cost function is derived from euclidean distance of point-...

متن کامل

Dynamic Volume Completion and Deformation

A new class of dynamic volume completion is introduced, where image elements (e.g., occluding semi-ellipses placed at the edge of an object) can link across a gap between two or more objects, leading to the perception of illusory volumes that deform as those image elements are set into relative motion. These new demonstrations provide further evidence that volume completion is not dictated sole...

متن کامل

Quality point cloud normal estimation by guided least squares representation

In this paper, we present a quality point cloud normal estimation method via subspace segmentation based on guided least squares representation. A structure guided low-rank subspace segmentation model has been employed in normal estimation (LRRSGNE). In order to select a consistent sub-neighborhood for a point, the subspace segmentation model is adopted to analyze the underlying structure of it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2021

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2021.3097081